From Constraint Minimization to Goal Optimization in CLP Languages
نویسنده
چکیده
In this paper we discuss how the ability of the constraint solvers to deal with constraint minimization can be lifted up to various forms of goal optimization within CLP languages. We emphasis the link there is between optimization and negation both in the declarative semantics and in the operational aspects. We also discuss the design of incremental execution models in an \optimization as interaction" paradigm.
منابع مشابه
Effectiveness of Optimizing Compilation for CLP(R)
Constraint Logic Programming (CLP) languages extend logic programming by allowing constraints from diierent domains such as real numbers or Boolean functions. They have proved to be ideal for expressing problems that require interactive mathematical modelling and complex combinatorial optimization problems. However, CLP languages have mainly been considered as research systems, useful for rapid...
متن کاملCLP(F) and Constrained ODEs
In this paper we present a preliminary report on the new language , CLP(F), which is a constraint logic programming language whose underlying domain contains the domain of real-valued functions of one variable. More precisely, the domain consists of booleans, integers, real numbers, real-valued functions of one variable and vectors of domain elements. Functions can be constrained by functional ...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملConstraint Programming H El Ene Fargier
There has been a lot of interest lately from people solving constrained optimization problems for Constraint Programming (CP). Constraint programming cannot be described as a technique by itself but perhaps better as a class of computer languages tailored to the expression and resolution of problems which are non-deterministic in nature, with a fast program development and eecient runtime perfo...
متن کاملRedundancy of Variables in CLP (R)
Constraint logic programming (CLP) languages allow natural and concise programming with constraints. In executing CLP languages the cost of constraint solving dominates the time and space considerations, so optimization of constraint solving is of paramount importance. CLP(R) is a constraint logic programming language over real numbers. Typically, in the execution of a CLP(R) program, many vari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996